Verification of Web Services with Timed Automata
نویسندگان
چکیده
In this paper we show how we can use formal methods for describing and analyzing the behavior of Web Services, and more specifically those including time restrictions. Then, our starting point are Web Services descriptions written in WSCI WSCDL (XML-based description languages). These descriptions are then translated into timed automata, and then, we use a well known tool that supports this formalism (UPPAAL) to simulate and analyze the system behavior. As illustration we take a particular case study, a travel reservation system.
منابع مشابه
Analysis and Verification of Web Services Resource Framework (WSRF) Specifications Using Timed Automata
Throughout the history of computing, engineers have used various formal methods to improve the quality of software and hardware. The next natural step is trying to exploit their advantages in the so-called new era of computing: Cloud Computing. In this paper, we present a first approximation about how to simulate and check the behaviour of these systems using timed automata through the model ch...
متن کاملModel Checking Techniques applied to the design of Web Services
In previous work we have presented the generation of WS-CDL and WS-BPEL documents. In this paper we show the unification of both generations. The aim is to generate correct WS-BPEL skeleton documents from WS-CDL documents by using the Timed Automata as an intermediary model in order to check the correctness of the generated Web Services with Model Checking Techniques. The model checker used is ...
متن کاملWST: a tool supporting timed composite Web Services Model transformation
In this paper we introduce a tool called the Web Service Translation tool (WST), which we are developing to implement a methodology for the design, validation and verification of Web Services with timed restrictions. This methodology works by making several translations, from phase to phase in the software development life cycle, where the system is represented at each phase by XML models. We u...
متن کاملVerification of Computation Orchestration Via Timed Automata
Recently, a promising programming model called Orc has been proposed to support a structured way of orchestrating distributed web services. Orc is intuitive because it offers concise constructors to manage concurrent communication, time-outs, priorities, failure of sites or communication and so forth. The semantics of Orc is also precisely defined. However, there is no verification tool availab...
متن کاملRDTA: Recursive and Dynamic Timed Automata for Web Services Composition Analysis
Web services are very dynamic, they are all around us and we use them every day without even knowing it. In this paper, the authors define a formal model for dynamic Web services composition and they investigate how it can be used to specify and analyse backward recovery procedures, updating partner services in case of failure. First, they propose Recursive and Dynamic Timed Automata (RDTA) mod...
متن کامل